A Dynamic Committee Scheme on Multiple-Criteria Linear Programming Classification Method

This paper aims to provide a scheme for effectively and efficiently finding an approximately optimal example size with respect to a given dataset when using Multiple-Criteria Linear Programming (MCLP) classification method. By integrating techniques of both progressive sampling and classification committee, it designs a dynamic classification committee scheme for MCLP. The experimental results have shown that our idea is feasible and the scheme is effective and efficient for exploring an approximately optimal sample size. The empirical results also help us to further investigate some general specialties of MCLP, such as the more general function expressions reflecting the relationship between accuracy and sample size, and between computing cost and sample size.